منابع مشابه
Locality and Hard SAT-Instances
In this note we construct a family of SAT-instance based on Eulerian graphs which are aimed at being hard for resolution based SAT-solvers. We discuss some experiments made with instances of this type and how a solver can try to avoid at least some of the pitfalls presented by these instances. Finally we look at how the density of subformulae can influence the hardness of SAT instances.
متن کاملLocality in Random SAT Instances
Despite the success of CDCL SAT solvers solving industrial problems, there are still many open questions to explain such success. In this context, the generation of random SAT instances having computational properties more similar to realworld problems becomes crucial. Such generators are possibly the best tool to analyze families of instances and solvers behaviors on them. In this paper, we pr...
متن کاملHard SAT and CSP instances with Expander Graphs
In this paper we provide a new method to generate hard k-SAT instances. Basically, we construct the bipartite incidence graph of a k-SAT instance where the left side represents the clauses and the right side represents the literals of our Boolean formula. Then, the clauses are filled by incrementally connecting both sides while keeping the girth of the graph as high as possible. That assures th...
متن کاملPseudo proof systems and hard instances of SAT ∗ – Preprint –
We link two concepts from the literature, namely hard sequences for the satisfiability problem sat and so-called pseudo proof systems proposed for study by Kraj́ıček. Pseudo proof systems are elements of a particular nonstandard model constructed by forcing with random variables. Speaking in standard terms, pseudo-proof systems are propositional proof systems that are unsound in the sense that t...
متن کاملGenerating Hard SAT/CSP Instances Using Expander Graphs
In this paper we provide a new method to generate hard k-SAT instances. We incrementally construct a high girth bipartite incidence graph of the k-SAT instance. Having high girth assures high expansion for the graph, and high expansion implies high resolution width. We have extended this approach to generate hard n-ary CSP instances and we have also adapted this idea to increase the expansion o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal on Satisfiability, Boolean Modeling and Computation
سال: 2006
ISSN: 1574-0617
DOI: 10.3233/sat190024